8,559 research outputs found

    Stability properties and asymptotics for N non-minimally coupled scalar fields cosmology

    Full text link
    We consider here the dynamics of some homogeneous and isotropic cosmological models with NN interacting classical scalar fields non-minimally coupled to the spacetime curvature, as an attempt to generalize some recent results obtained for one and two scalar fields. We show that a Lyapunov function can be constructed under certain conditions for a large class of models, suggesting that chaotic behavior is ruled out for them. Typical solutions tend generically to the empty de Sitter (or Minkowski) fixed points, and the previous asymptotic results obtained for the one field model remain valid. In particular, we confirm that, for large times and a vanishing cosmological constant, even in the presence of the extra scalar fields, the universe tends to an infinite diluted matter dominated era.Comment: 10 page

    Superinflation, quintessence, and the avoidance of the initial singularity

    Get PDF
    We consider the dynamics of a spatially flat universe dominated by a self-interacting nonminimally coupled scalar field. The structure of the phase space and complete phase portraits for the conformal coupling case are given. It is shown that the non-minimal coupling modifies drastically the dynamics of the universe. New cosmological behaviors are identified, including superinflation (H˙>0\dot{H}>0), avoidance of big bang singularities through classical birth of the universe from empty Minkowski space, and spontaneous entry into and exit from inflation. The relevance of this model to the description of quintessence is discussed.Comment: RevTex, 10 pages, 4 figures, To appear in the proceedings of the 5th Peyresq meetin

    On the performance of algorithms for the minimization of 1\ell_1-penalized functionals

    Full text link
    The problem of assessing the performance of algorithms used for the minimization of an 1\ell_1-penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of `approximation isochrones' is introduced. Five different iterative minimization algorithms are tested and compared, as well as two warm-start strategies. Both well-conditioned and ill-conditioned problems are used in the comparison, and the contrast between these two categories is highlighted.Comment: 18 pages, 10 figures; v3: expanded version with an additional synthetic test problem

    An integer representation for periodic tilings of the plane by regular polygons

    Get PDF
    We describe a representation for periodic tilings of the plane by regular polygons. Our approach is to represent explicitly a small subset of seed vertices from which we systematically generate all elements of the tiling by translations. We represent a tiling concretely by a (2+n)×4 integer matrix containing lattice coordinates for two translation vectors and n seed vertices. We discuss several properties of this representation and describe how to exploit the representation elegantly and efficiently for reconstruction, rendering, and automatic crystallographic classification by symmetry detection
    corecore